Optimal block diagonal scaling of block 2-cyclic matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Diagonal Matrices

For simplicity, we adopt the following rules: i, j, m, n, k denote natural numbers, x denotes a set, K denotes a field, a, a1, a2 denote elements of K, D denotes a non empty set, d, d1, d2 denote elements of D, M , M1, M2 denote matrices over D, A, A1, A2, B1, B2 denote matrices over K, and f , g denote finite sequences of elements of N. One can prove the following propositions: (1) Let K be a ...

متن کامل

Block Diagonalization of Nearly Diagonal Matrices

In this paper we study the effect of block diagonalization of a nearly diagonal matrix by iterating the related Riccati equations. We show that the iteration is fast, if a matrix is diagonally dominant or scaled diagonally dominant and the block partition follows an appropriately defined spectral gap. We also show that both kinds of diagonal dominance are not destroyed after the block diagonali...

متن کامل

ON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION

The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...

متن کامل

Block Companion Matrices, Discrete–time Block Diagonal Stability and Polynomial Matrices

A polynomial matrix G(z) = Izm −∑m−1 i=0 Ciz with complex coefficients is called discrete-time stable if its characteristic values (i.e. the zeros of detG(z) ) are in the unit disc. A corresponding block companion matrix C is used to study discrete-time stability of G(z) . The main tool is the construction of block diagonal solutions P of a discrete-time Lyapunov inequality P−C∗PC 0 .

متن کامل

Block Diagonal Majorization on $C_{0}$

Let $mathbf{c}_0$ be the real vector space of all real sequences which converge to zero. For every $x,yin mathbf{c}_0$, it is said that $y$ is block diagonal majorized by $x$ (written $yprec_b x$) if there exists a block diagonal row stochastic matrix $R$ such that $y=Rx$. In this paper we find the possible structure of linear functions $T:mathbf{c}_0rightarrow mathbf{c}_0$ preserving $prec_b$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1982

ISSN: 0024-3795

DOI: 10.1016/0024-3795(82)90014-3